Searching sequence space for ATP-binding proteins
نویسندگان
چکیده
منابع مشابه
Double Sequence Iterations for Strongly Contractive Mapping in Modular Space
In this paper, we consider double sequence iteration processes for strongly $rho$-contractive mapping in modular space. It is proved, these sequences, convergence strongly to a fixed point of the strongly $rho$-contractive mapping.
متن کامل“Sequence space soup” of proteins and copolymers
To study the protein folding problem, we use exhaustive computer enumeration to explore “sequence space soup,” an imaginary solution containing the “native” conformations (i.e., of lowest free energy) under folding conditions, of every possible copolymer sequence. The model is of short self-avoiding chains of hydrophobic (H) and polar (P) monomers configured on the two-dimensional square lattic...
متن کاملData for proteomic analysis of ATP-binding proteins and kinase inhibitor target proteins using an ATP probe
Interactions between ATP and ATP-binding proteins (ATPome) are common and are required for most cellular processes. Thus, it is clearly important to identify and quantify these interactions for understanding basic cellular mechanisms and the pathogenesis of various diseases. We used an ATP competition assay (competition between ATP and acyl-ATP probes) that enabled us to distinguish specific AT...
متن کاملStructural Binding Pocket Clustering and Protein-Ligand Interaction Analysis for ATP-binding Proteins
More and more protein-ligand complex structures have been deposited in the Protein Databank. The most important application of structural information about protein-ligand complex lies in the rational design of drugs, which affects proteins in a particular way, i.e. inhibitors causing a particular desired effect. The interaction analyses of protein-ligand binding may then allow the development o...
متن کاملGraphs for Metric Space Searching
[Who doesn’t understand a glance, won’t understand a long explanation either.] – Arab proverb The problem of Similarity Searching consists in finding the elements from a set which are similar to a given query under some criterion. If the similarity is expressed by means of a metric, the problem is called Metric Space Searching. In this thesis we present new methodologies to solve this problem u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genome Biology
سال: 2001
ISSN: 1474-760X
DOI: 10.1186/gb-2001-2-6-reports0015